Efficient algorithms for training the parameters of hidden Markov models using stochastic expectation maximization (EM) training and Viterbi training

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adjusted Viterbi training for hidden Markov models

We consider estimation of the emission parameters in hidden Markov models. Commonly, one uses the EM algorithm for this purpose. However, our primary motivation is the Philips speech recognition system wherein the EM algorithm is replaced by the Viterbi training algorithm. Viterbi training is faster and computationally less involved than EM, but it is also biased and need not even be consistent...

متن کامل

The adjusted Viterbi training for hidden Markov models

The EM procedure is a principal tool for parameter estimation in the hidden Markov models. However, applications replace EM by Viterbi extraction, or training (VT). VT is computationally less intensive, more stable and has more of an intuitive appeal, but VT estimation is biased and does not satisfy the following fixed point property. Hypothetically, given an infinitely large sample and initial...

متن کامل

An expectation maximization algorithm for training hidden substitution models.

We derive an expectation maximization algorithm for maximum-likelihood training of substitution rate matrices from multiple sequence alignments. The algorithm can be used to train hidden substitution models, where the structural context of a residue is treated as a hidden variable that can evolve over time. We used the algorithm to train hidden substitution matrices on protein alignments in the...

متن کامل

Discriminative training using the trusted expectation maximization

We present the Trusted Expectation-Maximization (TEM), a new discriminative training scheme, for speech recognition applications. In particular, the TEM algorithm may be used for Hidden Markov Models (HMMs) based discriminative training. The TEM algorithm has a form similar to the ExpectationMaximization (EM) algorithm, which is an efficient iterative procedure to perform maximum likelihood in ...

متن کامل

Training Hidden Non-markov Models

Hidden Markov models (HMM) are well known in speech recognition, where they are trained to recognize spoken words and even whole sentences. They are used to find the parameters of a so-called hidden model (usually a DTMC) by training it with observed output sequences. This paper introduces an approach to train stochastic Petri nets with the methods of HMM. As opposed to a DTMC, a stochastic Pet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms for Molecular Biology

سال: 2010

ISSN: 1748-7188

DOI: 10.1186/1748-7188-5-38